Independence of solution sets and minimal asymptotic bases

نویسندگان

  • Melvyn B. Nathanson
  • Prasad Tetali
چکیده

(4) 0 < a1 < a2 < . . . < ak and ai ∈ A for i = 1, . . . , k. The set A is called an asymptotic basis of order k if there exists a natural number n1 such that rA(n) > 0 for all n ≥ n1. The set A is called a strict asymptotic basis of order k if there exists a natural number n1 such that r′ A(n) > 0 for all n ≥ n1. All bases considered in this paper will be either asymptotic or strict asymptotic bases of order k. Erdős and Tetali [7] gave a probabilistic construction of a strict asymptotic basis S of order k whose representation function satisfies log n r′ S(n) logn. An asymptotic basis (resp. strict asymptotic basis) A is called minimal if the removal of any element from the basis destroys all representations of some infinite sequence of numbers, that is, A \ {a} is not an asymptotic

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space

Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...

متن کامل

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

Independence of an Equivariant and Invariant‎ Functions in Generalized Normal Family‎

In this paper we explain a necessary and sufficent condition for independence between any arbitrary statistics with sufficient statistics which is also maximum likelihood estimator in a general‎ ‎exponential family with location and scale parameter namely generalized normal distribution‎. ‎At the end‎, ‎it is shown that the converse is true except in the asymptotic cases‎.

متن کامل

Systems of Distinct Representatives and Minimal Bases in Additive Number Theory

The set A of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer is the sum of h elements of A . For example, the squares form an asymptotic basis of order 4 and the square-free numbers form an asymptotic basis of order 2 . If A is an asymptotic basis of order h, but no proper subset of A is an asymptotic basis of order h, then A is a minimal asymptotic ba...

متن کامل

On the generation of circuits and minimal forbidden sets

We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994